On $U$-rank $2$ types
نویسندگان
چکیده
منابع مشابه
Rank 2 Types for Term Graph Rewriting
We define a notion of type assignment with polymorphic intersection types of rank 2 for a term graph rewriting language that expresses sharing and cycles. We show that type assignment is decidable through defining, using the extended notion of unification from [5], a notion of principal pair which generalizes ml’s principal type property.
متن کاملModular Control-Flow Analysis with Rank 2 Intersection Types
The performance of optimising compilers crucially depends on the availability of controlflow information at compile time. For any first-order imperative program, such information is available via a flowchart constructed from the program text. Consequently, traditional dataflow analyses can be used to perform a series of compile-time program optimisations (Aho et al. 1986). For higher-order prog...
متن کاملRank 2 Types for Term Graph Rewriting Extended
We define a notion of type assignment with polymorphic intersection types of rank 2 for a term graph rewriting language that expresses sharing and cycles. We show that type assignment is decidable through defining, using the extended notion of unification from [5], a notion of principal pair which generalizes ml’s principal type property.
متن کاملF U N D a M E N T a Mathematicae M-rank and Meager Types
Assume T is superstable and small. Using the multiplicity rankM we find locally modular types in the same manner as U -rank considerations yield regular types. We define local versions of M-rank, which also yield meager types. 0. Introduction. Throughout, T is superstable, small, and we work in C = C. In [Ne1] we defined the multiplicity rank M and proved that M has additivity properties simila...
متن کاملCategoricity and U-rank in excellent classes
Let K be the class of atomic models of a countable first order theory. We prove that ifK is excellent and categorical in some uncountable cardinal, then each model is prime and minimal over the basis of a definable pregeometry given by a quasiminimal set. This implies thatK is categorical in all uncountable cardinals. We also introduce a U-rank to measure the complexity of complete types over m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1994
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-1994-1142779-1